Point Visibility Graph Recognition is NP-Hard
نویسندگان
چکیده
منابع مشابه
Point visibility graph recognition is NP-hard
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.
متن کاملUnit disk graph recognition is NP-hard
Unit disk graphs are the intersection graphs of unit diameter closed disks in the plane. This paper reduces SATISFIABILITY to the problem of recognizing unit disk graphs. Equivalently, it shows that determining if a graph has sphericity 2 or less, even if the graph is planar or is known to have sphericity at most 3, is NP-hard. We show how this reduction can be extended to 3 dimensions, thereby...
متن کاملNearest Neighbour Graph Realizability is NP-hard
1 I n t r o d u c t i o n This paper investigates the problem of realizing a given graph G as a "nearest neighbour graph" of a set P of points in the plane. Roughly speaking, a "nearest neighbour graph" is a geometric graph formed from a set of points in the plane by joining two points if one is the nearest neighbour of the other. Fig. 1. A mutual nearest neighbour graph One specific kind of ne...
متن کاملPlanar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the vertices V are embedded onto the points P is NP-complete, even when G is 2-connected and 2-outerplanar. This settles an open problem posed in [2, 4, 13].
متن کاملYet Another Graph Partitioning Problem is NP-Hard
Recently a large number of graph separator problems have been proven to be NPHard. Amazingly we have found that α-Subgraph-Balanced-Vertex-Separator, an important variant, has been overlooked. In this work “Yet Another Graph Partitioning Problem is NP-Hard” we present the surprising result that α-SubgraphBalanced-Vertex-Separator is NP-Hard. This is despite the fact that the constraints of our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2016
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195916500011